Sur un théorème de M. Bertrand

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deux Remarques sur un Théorème de S. Eilenberg

— We give hère a proof of the « cross section theorem » that is slightly différent from the original one. This allows us not only to show the existence of a rational cross section ofany rational set but also to describe such a cross section by means ofthe lexicographie ordering of the words. With some examples we also show that if we use the ordering ofwords by length, instead of the lexicograp...

متن کامل

Analyse de complexité pour un théorème de Hall sur les fractions continues

We give in this paper a polynomial time controlled version of a theorem of M. Hall : every real number can be written as the sum of two irrational numbers whose dfcs contain only 1, 2 3 or 4..

متن کامل

Un ordonnancement dynamique de tâches stochastiques sur un seul processeur

We show that a particular dynamic priority given to jobs in a multitasks operating system of computers is a deteriorating jobs or a delaying jobs scheduling. Under some assumptions we also show that it is an index rule. To do this, we present the tool of bandit processes to solve stochastic scheduling problems on a single machine. Résumé. Nous montrons qu’une priorité dynamique particulière all...

متن کامل

Un schéma d’interpolation rationnel sur un quadrilatère de classe C2

Let Q be a partition of a polygonal domain of the plan into convexe quadrilatéral. Given a regular function ƒ , we construct a function Hf G C(H), interpolating position values and derivatives of ƒ up of order 2 at vertices of Q. On each quadrilatéral Q G Q, Tlf\Q is a flnite element obtained from a polynomial scheme of FVS type by adding some rational functions. Résumé. Soit Q une partition en...

متن کامل

Un environnement de conception de systèmes distribués basé sur UML

This paper introduces a new environment for developing distributed systems. It is based on the TURTLE UML profile. Analysis and design phases, described in previous papers, have been extended with an additional deployment phase. In this new step, TURTLE components are deployed over hardware execution nodes, and nodes are connected together throughout links. TURTLE deployment diagrams are given ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin de la Société mathématique de France

سال: 1894

ISSN: 0037-9484,2102-622X

DOI: 10.24033/bsmf.502